Separation Logic and the Mashup Isolation Problem

This work was done as part of my PhD qualifier exam. My qualifier exam problem was to perform an in depth study of separation logic. In this paper, I survey two variants of separation and then show how they can applied to solve the isolation problem for mashups. I rigorously define the inter-component isolation property for basic a class of mashups, called variable separated mashups. I then derive two procedures for verifying isolation of variable separated mashups using separation logic and its variants. Finally, I provide a rigorous proof of correctness for both the procedures.